TSTP Solution File: NUM736^1 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 10:57:23 EDT 2023

% Result   : Theorem 3.50s 3.67s
% Output   : Proof 3.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM736^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n026.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Aug 25 12:48:48 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 3.50/3.67  SZS status Theorem for theBenchmark.p
% 3.50/3.67  SZS output start Proof for theBenchmark.p
% 3.50/3.67  Clause #0 (by assumption #[]): Eq (more (ts (num x) (den y)) (ts (num y) (den x))) True
% 3.50/3.67  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), more Xx Xy → less Xy Xx) True
% 3.50/3.67  Clause #2 (by assumption #[]): Eq (Not (less (ts (num y) (den x)) (ts (num x) (den y)))) True
% 3.50/3.67  Clause #3 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), more a Xy → less Xy a) True
% 3.50/3.67  Clause #4 (by clausification #[3]): ∀ (a a_1 : nat), Eq (more a a_1 → less a_1 a) True
% 3.50/3.67  Clause #5 (by clausification #[4]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.50/3.67  Clause #6 (by superposition #[0, 5]): Or (Eq (less (ts (num y) (den x)) (ts (num x) (den y))) True) (Eq False True)
% 3.50/3.67  Clause #7 (by clausification #[2]): Eq (less (ts (num y) (den x)) (ts (num x) (den y))) False
% 3.50/3.67  Clause #8 (by clausification #[6]): Eq (less (ts (num y) (den x)) (ts (num x) (den y))) True
% 3.50/3.67  Clause #9 (by superposition #[8, 7]): Eq True False
% 3.50/3.67  Clause #10 (by clausification #[9]): False
% 3.50/3.67  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------